Browsing by Subject "Independent tasks"
Now showing items 1-4 of 4
-
Article
The Do-All problem with Byzantine processor failures
(2005)Do-All is the abstract problem of using n processors to cooperatively perform m independent tasks in the presence of failures. This problem and its derivatives have been a centerpiece in the study of trade-offs between ...
-
Conference Object
A parallel implementation of a multi-objective evolutionary algorithm
(2009)Multi-objective Evolutionary Algorithms (MOEAs) have features that can be exploited to harness the processing power offered by modern multi-core CPUs. Modern programming languages offer the ability to use threads and ...
-
Article
Work-competitive scheduling for cooperative computing with dynamic groups
(2005)The problem of cooperatively performing a set of t tasks in a decentralized computing environment subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable networks is ...
-
Conference Object
Work-competitive scheduling for cooperative computing with dynamic groups
(2003)The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable ...